Successive Approximate Algorithm for Best Approximation from a Polyhedron
نویسندگان
چکیده
منابع مشابه
A Successive Approximation Algorithm for Coordination Problems
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm a...
متن کاملA successive approximation algorithm for the multiple knapsack problem
It is well-known that the multiple knapsack problem is NP-hard, and does not admit an FPTAS even for the case of two identical knapsacks. Whereas the 0-1 knapsack problem with only one knapsack has been intensively studied, and some effective exact or approximation algorithms exist. A natural approach for the multiple knapsack problem is to pack the knapsacks successively by using an effective ...
متن کاملA Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملCyclic AFD Algorithm for Best Rational Approximation
We propose a practical algorithm of best rational approximation of a given order to a function in the Hardy H space on the unit circle or on the real line. The type approximation is proved to be equivalent with Blaschke form approximation. The algorithm is called Cyclic AFD as it adaptively selects one parameter during each cycle based on the Maximal Selection Principle used in adaptive Fourier...
متن کاملBest Approximation in TVS
In this paper we give newresults on the best approximation in the Hausdorff topological vectorspace and consider relationship with orthogonality. Also we determined under what conditions the map $P_{K,f}$ is upper semicontinous.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1998
ISSN: 0021-9045
DOI: 10.1006/jath.1998.3174